Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Democracy index for Africa, 2010

ABSTRACT

Natural resource-based conflicts continue to occur in different parts of Nigeria with negative implications. This study investigated the phenomena of natural resource conflicts vis-à-vis their propensities to impact political economy and national security negatively. Data for the study were sourced from theoretical and empirical evidence. Empirical data were sourced from existing studies selected on the basis on their relevance to the study and analysed based on their content. The limitation to this approach is the obsolete and subjective nature of some the literature. This limitation was, however, addressed among others through the author’s knowledge of the issues under study. The study found that Nigeria is enmeshed in conflict over ownership, distribution, access to or competition over natural resources such as petroleum resources and agricultural land and these conflicts have undermined democracy, human rights, the economy and the nation’s security. The paper identified poor resource governance, environmental factors and poor political leadership as the causes and drivers of these conflicts. It recommends natural resource governance among others, as a way out of the problem.     

基于多假设跟踪弹道导弹主动段跟踪算法

针对弹道导弹主动段防御中多枚弹道导弹同时跟踪问题,提出了基于多假设思想的主动段跟踪算法.重点阐述了该算法中假设生成、假设概率计算、假设约简以及假设剪枝等环节.从工程实用的角度出发,采用求解一个线性分配问题(LAP)方法得到M个最优假设,大大减少了假设数量,并运用N-scan回溯剪枝方法对假设进行剪枝,确定要输出的航迹,提高了算法的效率和实用性.仿真实验表明,该算法能够对主动段多枚弹道导弹目标准确关联跟踪.     

车载多接入边缘网络中联合资源分配和动态任务卸载方案

针对车联网中车辆移动速度过快产生的任务卸载失败问题,设计了一个有效的任务卸载风险评估模型,并提出了联合资源分配的动态任务卸载方案。将时间、能耗和风险共同建模为系统效用,通过联合优化卸载决策、资源分配来最大化系统效用。优化问题被公式化为混合整数非线性规划,在给定卸载决策的情况下,利用凸优化技术解决计算资源分配问题,功率分配通过分式规划技术来优化。仿真分析了车辆移动性对系统效用的影响,证明了所提方案的合理性。     

驱护舰编队防空火力分配决策模型研究

驱护舰编队防空火力分配的确定和优化是最大限度地发挥驱护舰编队的整体作战能力的关键。为了高效地发挥驱护舰编队火力优势,用运筹学理论建立了驱护舰编队防空火力分配决策问题的优化模型,分析了各种解决此模型的方法的优缺点,并尝试运用粒子群优化理论(PSO)求解该模型。实例计算分析表明,所提出的方法较好地解决了驱护舰防空火力分配决策问题,为舰艇编队指挥员进行防空火力分配决策提供了一种有效的参考处理方法。     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Some probability functions in reliability and their applications

There has been much research on the general failure model recently. In the general failure model, when the unit fails at its age t, Type I failure (minor failure) occurs with probability 1 ? p(t) and Type II failure (catastrophic failure) occurs with probability p(t). In the previous research, some specific shapes (constant, non‐decreasing, or bathtub‐shape) on the probability function p(t) are assumed. In this article, general results on some probability functions are obtained and applied to study the shapes of p(t). The results are also applied to determining the optimal inspection and allocation policies in maintenance problems. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

基于时变量测方差的多传感器多目标优化分配算法

在目标跟踪过程中,目标的动态模型通常在笛卡尔坐标系中,而量测是在极/球坐标系中得到的。在基于卡尔曼滤波及其一些改进算法中,设定量测方差固定不变,可能导致滤波发散。为此提出了一种基于时变量测方差的多传感器资源管理算法。该算法通过统计方法求出转换测量值误差的均值和方差,利用转化卡尔曼滤波算法估计误差协方差,基于协方差的效能函数进行多传感器多目标分配。仿真结果显示该算法在目标跟踪过程中满足跟踪精度要求,并实现传感器资源的充分的利用。     

基于STN的任务执行过程中的资源冲突自动消解

任务在执行过程中受到各种因素的影响,任务时间可能会偏离预定计划,在资源数量有限的情况下,由于要满足时间的约束,往往会出现时间重叠而发生资源冲突。消解这种资源冲突的一个最直接的方法是及时调整任务计划时间消解潜在的资源冲突。针对任务执行过程中冲突消解人工决策耗时较长的问题,设计了一种基于STN的任务在执行过程中的自动消解方法,通过案例仿真,证明方法是可行的,并且能够比人工决策方式节约时间。